Testing Semantics for Unbounded Nondeterminism
نویسندگان
چکیده
We present an extension of the classical testing semantics for the case when nondeterminism is unbounded. We deene the corresponding may and must preorders in the new framework. As in the bounded setting the may preorder can be characterized by using the set of nite traces of processes. On the contrary, in order to characterize the must preorder is necessary to record some additional information about the innnite behavior of processes. This characterization will be an extension of acceptance sets, considering not only the nite traces a process can execute but also its innnite traces.
منابع مشابه
Intensional and Extensional Semantics of Bounded and Unbounded Nondeterminism
We give extensional and intensional characterizations of nondeterministic functional programs: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them. A fundamental result establishes that the extensional and intensional representations of non-deterministic programs are equivalent, by showing how t...
متن کاملUnbounded Nondeterminism in CSP
We extend the failures/divergences model for CSP to include a component of infinite traces. This allows us to give a denotational semantics for a version of CSP including general nondeterministic choice and infinite hiding. Unfortunately the model is an incomplete partial order, so it is by no means obvious that the necessary fixed points exist. We have two proofs of this result, one via a cong...
متن کاملA Complete Axiomatic Semantics for the CSP Stable-Failures Model
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been given in operational style. A Csp semantics in axiomatic style, however, has been considered problematic in the literature. In this paper we present a sound and complete axiomatic semantics for Csp with unbounded nondet...
متن کاملCombining CSP and Object-Z: Finite or Infinite Trace Semantics?
In this paper we compare and contrast two alternative semantics as a means of combining CSP with Object-Z. The purpose of this combination is to more effectively specify complex, concurrent systems: while CSP is ideal for modelling systems of concurrent processes, Object-Z is more suitable for modelling the data structures often needed to model the processes themselves. The first semantics, the...
متن کاملAn Unbounded Nondeterministic Model for CSP-like Languages
The main contribution of this paper is the introduction of unbounded nondeterminism into CSP-like languages with specification, which increases the expressive power of the specification language. This is achieved by extending the finite message set of such mixed languages to an infinite one. A denotational semantics and a refinement order are defined for such a language and the CSP constructors...
متن کامل